Indistinguishability of the components of random spanning forests
نویسنده
چکیده
We prove that the infinite components of the Free Uniform Spanning Forest (FUSF) of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the Free Minimal Spanning Forest (FMSF). We also show that with the above assumptions there can only be 0, 1 or infinitely many components, which solves the problem for the FUSF of Caylay graphs completely. These answer questions by Benjamini, Lyons, Peres and Schramm for Cayley graphs, which have been open up to now. Our methods apply to a more general class of percolations, those satisfying “weak insertion tolerance”, and work beyond Cayley graphs, in the more general setting of unimodular random graphs.
منابع مشابه
Fault Locating in High Voltage Transmission Lines Based on Harmonic Components of One-end Voltage Using Random Forests
In this paper, an approach is proposed for accurate locating of single phase faults in transmission lines using voltage signals measured at one-end. In this method, harmonic components of the voltage signals are extracted through Discrete Fourier Transform (DFT) and are normalized by a transformation. The proposed fault locator, which is designed based on Random Forests (RF) algorithm, is train...
متن کاملSpanning Forests on Random Planar Lattices
The generating function for spanning forests on a lattice is related to the q-state Potts model in a certain q → 0 limit, and extends the analogous notion for spanning trees, or dense self-avoiding branched polymers. Recent works have found a combinatorial perturbative equivalence also with the (quadratic action) O(n) model in the limit n → −1, the expansion parameter t counting the number of c...
متن کاملUniform Spanning
We study uniform spanning forest measures on innnite graphs, which are weak limits of uniform spanning tree measures from nite subgraphs. These limits can be taken with free (FSF) or wired (WSF) boundary conditions. Pemantle (1991) proved that the free and wired spanning forests coincide in Z d and that they give a single tree ii d 6 4. In the present work, we extend Pemantle's alternative to g...
متن کاملThe Impact of the Spectral Filter Bandwidth on the Spectral Entanglement and Indistinguishability of Photon Pairs of SPDC Process
In this paper, we have investigated the dependence of the spectral entanglement and indistinguishability of photon pairs produced by the spontaneous parametric down-conversion (SPDC) procedure on the bandwidth of spectral filters used in the detection setup. The SPDC is a three-wave mixing process which occurs in a nonlinear crystal and generates entangled photon pairs and utilizes as one of th...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کامل